Generalized quantum circuit differentiation rules

نویسندگان

چکیده

Variational quantum algorithms that are used for machine learning rely on the ability to automatically differentiate parametrized circuits with respect underlying parameters. Here we propose rules differentiating (unitaries) arbitrary generators. Unlike standard parameter-shift rule valid unitaries generated by operators spectra limited at most two unique eigenvalues (represented involutory and idempotent operators), our approach also works generators a generic nondegenerate spectrum. Based spectral decomposition, derive simple recipe allows explicit derivative evaluation. The corresponds weighted sum of measured expectations shifted number function evaluations is equal positive nonzero gaps (eigenvalue differences) generator. We apply relevant examples two-qubit gates, among others showing so-called fermionic simulation (fSim) gate can be differentiated using four measurements. Additionally, present generalized differentiation case Pauli-string generators, based distinct shifts (here referred as triangulation approach), analyze variance measurements in different scenarios. Our work offers toolbox efficient hardware-oriented needed circuit optimization operator-based representation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Phase Rules

For a multi-component system, general formulas are derived for the dimension of a coex-isting region in the phase diagram in various state spaces.

متن کامل

Mining Generalized Association Rules

We introduce the problem of mining generalized association rules. Given a large database of transactions, where each transaction consists of a set of items, and a taxonomy (is-a hierarchy) on the items, we find associations between items at any level of the taxonomy. For example, given a taxonomy that says that jackets is-a outerwear is-e clothes, we may infer a rule that “people who buy outerw...

متن کامل

Generalized Reversible Rules

A generalized notion of reversible rules is presented in this paper to perform state reduction in automatic formal veriication. The key idea is that some of the transition rules in a design may be invertible, and therefore, they can be used to collapse subgraphs into abstract states, thereby reducing the state explosion problem. This paper improves upon previous work to achieve the following go...

متن کامل

Quantum Photonic Circuit

One promising approach for scalable quantum computing is to use an alloptical architecture, in which the qubits are represented by photons and manipulated by mirrors and beam splitters. So far, researchers have demonstrated this method, called Linear Optical Quantum Computing, on a very small scale by performing operations using just a few photons. In an attempt to scale up this method to large...

متن کامل

Quantum Circuit Complexity

We propose a complexity model of quantum circuits analogous to the standard (acyclic) Boolean circuit model. It is shown that any function computable in polynomial time by a quantum Turing machine has a polynomial-size quantum circuit. This result also enables us to construct a universal quantum computer which can simulate, with a polynomial factor slowdown, a broader class of quantum machines ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical review

سال: 2021

ISSN: ['0556-2813', '1538-4497', '1089-490X']

DOI: https://doi.org/10.1103/physreva.104.052417